Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers

نویسندگان

  • Richard A. Brualdi
  • Stephen J. Kirkland
چکیده

The Aztec diamond of order n is a certain configuration of 2n(n+1) unit squares. We give a new proof of the fact that the number Πn of tilings of the Aztec diamond of order n with dominoes equals 2. We determine a sign-nonsingular matrix of order n(n + 1) whose determinant gives Πn. We reduce the calculation of this determinant to that of a Hankel matrix of order n whose entries are large Schröder numbers. To calculate that determinant we make use of the J-fraction expansion of the generating function of the Schröder numbers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Proof of the Aztec Diamond Theorem

Based on a bijection between domino tilings of an Aztec diamond and nonintersecting lattice paths, a simple proof of the Aztec diamond theorem is given by means of Hankel determinants of the large and small Schröder numbers.

متن کامل

Alternating sign matrices and tilings of Aztec rectangles

The problem of counting numbers of tilings of certain regions has long interested researchers in a variety of disciplines. In recent years, many beautiful results have been obtained related to the enumeration of tilings of particular regions called Aztec diamonds. Problems currently under investigation include counting the tilings of related regions with holes and describing the behavior of ran...

متن کامل

A generalization of Aztec diamond theorem, part II

We consider a new family of 4-vertex regions with zigzag boundary on the square lattice with diagonals drawn in. By proving that the number of tilings of the new regions is given by a power 2, we generalize both Aztec diamond theorem and Douglas’ theorem. The proof extends an idea of Eu and Fu for Aztec diamonds, by using a bijection between domino tilings and non-intersecting Schröder paths, t...

متن کامل

Enumeration of Tilings of Diamonds and Hexagons with Defects

We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we obtain solutions to open problems 1, 2, and 10 in James Propp’s list of problems on enumeration of matchings [22].

متن کامل

Symmetry classes of spanning trees of Aztec diamonds and perfect matchings of odd squares with a unit hole

We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid Gn of order n is similar to the disjoint union of two copies of the quartered Aztec diamond QADn−1 of order n− 1 with the path P (2) n on n vertices having edge weights equal to 2. Our proof is based on an explicit change of basis in the vector space on which the adjacency matrix ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 94  شماره 

صفحات  -

تاریخ انتشار 2005